Enlarging the classes of super edge-magic 2-regular graphs
نویسندگان
چکیده
A graph G is called super edge-magic if there exists a bijective function f : V (G) ∪ E (G) → {1, 2, . . . , |V (G)|+ |E (G)|} such that f (V (G)) = {1, 2, . . . , |V (G)|} and f (u) + f (v) + f (uv) is a constant for each uv ∈ E (G). A graph G with isolated vertices is called pseudo super edge-magic if there exists a bijective function f : V (G) → {1, 2, . . . , |V (G)|} such that the set {f (u) + f (v) |uv ∈ E (G)} ∪ {2f (u) |degG u = 0} consists of |E (G)| + |{u ∈ V (G) |degG u = 0}| consecutive integers. In this paper, we enlarge the classes of super edge-magic 2-regular graphs by presenting some constructions that allow us to generate large classes of super edge-magic 2-regular graphs from previously known super edge-magic 2-regular graphs or pseudo super edge-magic graphs.
منابع مشابه
The place of super edge-magic labelings among other classes of labelings
A (p; q)-graph G is edge-magic if there exists a bijective function f :V (G)∪E(G)→{1; 2; : : : ; p + q} such that f(u) + f(v) + f(uv)= k is a constant, called the valence of f, for any edge uv of G. Moreover, G is said to be super edge-magic if f(V (G))= {1; 2; : : : ; p}. In this paper, we present some necessary conditions for a graph to be super edge-magic. By means of these, we study the sup...
متن کاملPerfect super edge - magic graphs
In this paper we introduce the concept of perfect super edge-magic graphs and we prove some classes of graphs to be perfect super edge-magic.
متن کاملA magical approach to some labeling conjectures
In this paper, a complete characterization of the (super) edge-magic linear forests with two components is provided. In the process of establishing this characterization, the super edge-magic, harmonious, sequential and felicitous properties of certain 2-regular graphs are investigated , and several results on super edge-magic and felicitous labelings of unions of cycles and paths are presented...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملOn the Super Edge-Magic Deficiency of Graphs
A (p,q) graph G is called super edge-magic if there exists a bijective function f from V (G) ∪ E(G) to {1, 2,. .. , p + q} such that f (x) + f (xy) + f (y) is a constant k for every edge xy of G and f (V (G)) = {1, 2,. .. , p}. Furthermore, the super edge-magic deficiency of a graph G is either the minimum nonnegative integer n such that G ∪ nK 1 is super edge-magic or +∞ if there exists no suc...
متن کامل